Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks
نویسندگان
چکیده
In this chapter the authors study the problems of data dissemination and query routing in mobile peer-to-peer networks. They provide a taxonomy and discussion of existing literature, spanning overlay topologies, query routing, and data propagation. They proceed by proposing content-driven routing and adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile users. In the authors’ mechanism, nodes build content synopses of their data and adaptively disseminate them to their most appropriate peers. Based on the content synopses, a routing mechanism is being built, to forward the queries to those peers that have a high probability of providing the desired results. The authors provide an experimental evaluation of different dissemination strategies, which shows that content-driven routing and adaptive data dissemination is highly scalable and significantly improves resource usage.
منابع مشابه
Leveraging Node Centrality and Regularity for Efficient Routing in Mobile Peer-to-Peer Networks
Solutions for data dissemination in traditional peer-to-peer networks are not suitable for mobile peer-to-peer networks due to the special characteristics of mobile environments, particularly highly variable connectivity, and disconnection. Mobile peer-to-peer data dissemination over Delay Tolerant Networks (DTNs) is a promising paradigm since they can tolerate frequent and long network partiti...
متن کاملSemantic-Driven K-Walkers-Based Search in Unstructured Peer-to-Peer Networks
In this paper, we present a semantic-driven kwalkers-based search scheme, called S2P2P, for data information dissemination and query routing in unstructured peer-to-peer (P2P) networks. In S2P2P, each peer maintains its observation on the semantics of received queries (demands) and data information (supplies), as well as a local view on network topology. On top of this, each peer, in line with ...
متن کاملA Model for Decentralized Information Dissemination
Peer-to-Peer computing paradigm may provide a solution to the retrieval problem in an ever burgeoning volume of online and digital information. While research has focused on the means of collaboration as a tool for query routing, we feel that there is a disconnect in the way P2P networks are handled and the expectations of performance in the real world. In the proposed work, we discuss the need...
متن کاملLocation-Based Mobile Querying in Peer-to-Peer Networks
Peer-to-peer (P2P) networks are receiving increasing attention in a variety of current applications. In this paper, we concentrate on applications where a mobile user queries peers to find either data (e.g., a list of restaurants) or services (e.g., a reservation service). We classify location-based queries in categories depending on parameters such as the user’s velocity, the nature of the des...
متن کاملABIDE: A Bid-Based Economic Incentive Model for Enticing Non-cooperative Peers in Mobile-P2P Networks
In mobile ad-hoc peer-to-peer (M-P2P) networks, a large percentage of the mobile peers typically do not provide any service to the network, thereby motivating incentive schemes for enticing non-cooperative mobile peers to provide service. We propose ABIDE, a novel bid-based economic incentive model for enticing non-cooperative mobile peers to provide service in M-P2P networks. The main contribu...
متن کامل